Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
نویسنده
چکیده
A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is presented. It calculates a matching with an edge weight of at least 1 2 of the edge weight of a maximum weighted matching. Its time complexity is O(jEj), with jEj being the number of edges in the graph. This improves over the previously known 1 2-approximation algorithms for maximum weighted matching which require O(jEj log(jV j)) steps, where jV j is the number of vertices.
منابع مشابه
Improved Linear Time Approximation Algorithms for Weighted Matchings
The weighted matching problem is to find a matching in a weighted graph that has maximum weight. The fastest known algorithm for this problem has running time O(nm + n log n). Many real world problems require graphs of such large size that this running time is too costly. We present a linear time approximation algorithm for the weighted matching problem with a performance ratio of 2 3 − ε. This...
متن کاملEfficient Distributed Weighted Matchings on Trees
In this paper, we study distributed algorithms to compute a weighted matching that have constant (or at least sub-logarithmic) running time and that achieve approximation ratio 2 + ǫ or better. In fact we present two such synchronous algorithms, that work on arbitrary weighted trees. The first algorithm is a randomised distributed algorithm that computes a weighted matching of an arbitrary weig...
متن کاملOn the Complexity of Weighted Greedy Matchings
Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight greedy matching on edge-weighted graphs, denoted GreedyMatching. This problem is to compute a matching with the maximum weight when every edge that is being added to the matching is chosen among the available edges wi...
متن کاملScaling algorithms for approximate and exact maximum weight matching
The maximum cardinality and maximum weight matching problems can be solved in time Õ(m √ n), a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article we demonstrate that this “m √ n barrier” is extremely fragile, in the following sense. For any > 0, we give an algorithm that computes a (1 − )-approximate maximum weig...
متن کاملPartitioning Graphs of Regular Degree
Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds on the bisection width of graphs with regular degree. It gives optimal upper bounds for very small...
متن کامل